Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
نویسندگان
چکیده
منابع مشابه
Non-Malleable Codes for Space-Bounded Tampering
Non-malleable codes—introduced by Dziembowski, Pietrzak and Wichs at ICS 2010— are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t. some class of tampering adversaries, result in a decoded value that is either identical or unrelated to the original message. Such codes are very useful for protecting arbitrary cryptographic primitives against tampering a...
متن کاملExplicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
A non-malleable code protects messages against various classes of tampering. Informally, a code is non-malleable if the message contained in a tampered codeword is either the original message, or a completely unrelated one. Although existence of such codes for various rich classes of tampering functions is known, explicit constructions exist only for “compartmentalized” tampering functions: i.e...
متن کاملNon-Malleable Codes for Small-Depth Circuits
We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by small-depth circuits. For constant-depth circuits of polynomial size (i.e. AC tampering functions), our codes have codeword length n = k for a k-bit message. This is an exponential improvement of the previous best construction due to Chattopadhyay and Li (STOC 2017), which had codew...
متن کاملNon-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
We show how to construct efficient, unconditionally secure non-malleable codes for bounded output locality. In particular, our scheme is resilient against functions such that any output bit is dependent on at most n bits, where n is the total number of bits in a codeword and 0 ≤ δ < 1 a constant. Notably, this tampering class includes NC .
متن کاملA Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
A non-malleable code protects messages against a class of tampering functions. Informally, a code is non-malleable if the effect of applying any tampering function on an encoded message is to either retain the message or to replace it with an unrelated message. Two main challenges in this area – apart from establishing the feasibility against different families of tampering – are to obtain expl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2613919